A Total, Ground path Ordering for Proving Termination of AC-Rewrite Systems
نویسندگان
چکیده
A new path ordering for showing termination of associative-commutative (AC) rewrite systems is deened. If the precedence relation on function symbols is total, the ordering is total on ground terms, but unlike the ordering proposed by Rubio and Nieuwenhuis, this ordering can orient the distributivity property in the proper direction. The ordering is deened in a natural way using recursive path ordering with status as the underlying basis. This settles a longstanding problem in termination orderings for AC rewrite systems. The ordering can be used to deene an ordering on nonground terms.
منابع مشابه
Proving Associative-Communicative Termination Using RPO-Compatible Orderings
Developing path orderings for associative-commutative (AC) rewrite systems has been quite a challenge at least for a decade. Compatibility with the recursive path ordering (RPO) schemes is desirable, and this property helps in orienting the commonly encountered distributiv-ity axiom as desired. For applications in theorem proving and constraint solving, a total ordering on ground terms involvin...
متن کاملA Total Ac-compatible Ordering with Rpo Scheme ?
Like Kapur and Sivakumar in KS97], we present an AC-compatible simpliication ordering total on ground terms that follows the same scheme as the recursive path ordering (RPO). The rst improvement with respect to their work is that our ordering has a simpler deenition, and as a consequence we can obtain simpler proofs for the properties of the ordering and get a better understanding of the diicul...
متن کاملA Total AC-Compatible Ordering Based on RPO
We deene a simpliication ordering on terms which is AC-compatible and total on non-AC-equivalent ground terms, without any restrictions on the signature like the number of AC-symbols or free symbols. Unlike previous work by Narendran and Rusinowitch NR91], our AC-RPO ordering is not based on polynomial interpretations, but on a simple extension of the well-known RPO ordering (with a total (arbi...
متن کاملPath Orderings for Termination of Associative-Commutative Rewriting
We show that a simple, and easily implementable, restriction on the recursive path ordering, which we call the "binary path condition," suffices for establishing termination of extended rewriting modulo associativity and commutativity. 1 I n t r o d u c t i o n Rewrite systems find application to various aspects of theorem proving and programming language semantics. The essential idea in rewrit...
متن کاملProving Termination of Ac-rewriting without Extended Rules
Polynomial interpretations and RPO-like orderings allow one to prove termination of Associative and Commutative (AC-)rewriting by only checking the rules of the given rewrite system without considering the so-called extended rules. However, these methods have important limitations as termination proving tools. To overcome these limitations, more powerful methods like the dependency pairs method...
متن کامل